Duality for mixed-integer convex minimization
نویسندگان
چکیده
منابع مشابه
Integer convex minimization by mixed integer linear optimization
Minimizing a convex function over the integral points of a bounded convex set is polynomial in fixed dimension [6]. We provide an alternative, short, and geometrically motivated proof of this result. In particular, we present an oraclepolynomial algorithm based on a mixed integer linear optimization oracle.
متن کاملMixed-Integer Convex Representability
We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer assignments is finite. We develop a characterization for the more general case of unbounded integer variables together with a simple necessary condition for re...
متن کاملDuality for Mixed Integer Linear Programs
The theory of duality for linear programs is well-developed and has been successful in advancing both the theory and practice of linear programming. In principle, much of this broad framework can be extended to mixed integer linear programs, but this has proven difficult, in part because duality theory does not integrate well with current computational practice. This paper surveys what is known...
متن کاملConvex relaxations for mixed integer predictive control
The main objective in this work is to compare different convex relaxations for Model Predictive Control (MPC) problems with mixed real valued and binary valued control signals. In the problem description considered, the objective function is quadratic, the dynamics are linear, and the inequality constraints on states and control signals are all linear. The relaxations are related theoretically ...
متن کاملUnbounded convex sets for non-convex mixed-integer quadratic programming
This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a set in the family. Some fundamental properties of the convex sets are derived, along with connections to some o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2015
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-015-0917-y